Adaptable Routing Strategy in Traffic Flow
نویسندگان
چکیده
To avoid congestion of the vehicle in traffic networks is one of the most important problems to establish effective movements of vehicles. In this paper, we propose a new routing strategy using a memory effect. Conventional routing strategies use probabilistic rules to route the vehicles on the traffic networks. On the other hand, our proposed method uses a deterministic rule, or the memory effect. The memory effect means how many vehicles are moved through the nodes in the past history. In addition, another reason why we use the memory effect is that every node does not need to communicate the adjacent nodes to route the vehicles to their destinations because the memory effect is the information owned by each node. From the results of the numerical simulations, by using the memory effect, our proposed method reduces the traffic congestion effectively compared with the conventional routing strategies. Then, we confirmed that our proposed strategy effectively routes the vehicles to their destinations.
منابع مشابه
Dynamic Source Routing Strategy for Two-Level Flows on Scale-Free Networks
Packets transmitting in real communication networks such as the Internet can be classified as time-sensitive or time-insensitive. To better support the real-time and time-insensitive applications, we propose a two-level flow traffic model in which packets are labeled as level-1 or level-2, and those with level-1 have higher priority to be transmitted. In order to enhance the traffic capacity of...
متن کاملCongestion estimation of router input ports in Network-on-Chip for efficient virtual allocation
Effective and congestion-aware routing is vital to the performance of network-on-chip. The efficient routing algorithm undoubtedly relies on the considered selection strategy. If the routing function returns a number of more than one permissible output ports, a selection function is exploited to choose the best output port to reduce packets latency. In this paper, we introduce a new selection s...
متن کاملEfficient path routing strategy for flows with multiple priorities on scale-free networks
In real networks, traffic flows are different in amount as well as their priorities. However, the latter priority has rarely been examined in routing strategy studies. In this paper, a novel routing algorithm, which is based on the efficient path routing strategy (EP), is proposed to overcome network congestion problem caused by large amount of traffic flows with different priorities. In this s...
متن کاملA network flow model for lane-based evacuation routing
Most traffic delays in regional evacuations occur at intersections. Lane-based routing is one strategy for reducing these delays. This paper presents a network flow model for identifying optimal lane-based evacuation routing plans in a complex road network. The model is an integer extension of the minimumcost flow problem. It can be used to generate routing plans that trade total vehicle travel...
متن کاملEvaluating the importance of dynamic allocation and routing of rescuers in reducing response time
Due to delay in receiving emergency medical services, a high number of injured people and patients annually lose their lives. Determining the medical service area and correct routing of rescuing operation is influential on the reduction of rescuers’ response time. Changing the traffic flow leads to change of medical service area. Therefore, it is expected that by observing changing traffic, the...
متن کامل